Long-range contact process and percolation on a random lattice
نویسندگان
چکیده
We study the phase transition phenomena for long-range oriented percolation and contact process. a process in which range of each vertex are independent, updated dynamically given by some distribution N. also an analogous model on hyper-cubic lattice, here there is special direction where bonds allowed; all vertices i.i.d. sequence random variables with common For both models, we prove results about existence terms
منابع مشابه
Contact process on one-dimensional long-range percolation
In this note, we prove that the contact process on the one-dimensional longrange percolation with high exponent exhibits a non-trivial phase transition: there is a critical value of the infection rate λc > 0, such that if λ > λc, the contact process survives with positive probability, whereas if λ < λc, it dies out a.s.
متن کاملLong-range percolation on the hierarchical lattice
We study long-range percolation on the hierarchical lattice of order N , where any edge of length k is present with probability pk = 1 − exp(−β−kα), independently of all other edges. For fixed β, we show that αc(β) (the infimum of those α for which an infinite cluster exists a.s.) is non-trivial if and only if N < β < N. Furthermore, we show uniqueness of the infinite component and continuity o...
متن کاملOn Long Range Percolation With Heavy Tails
Consider independent long range percolation on Z2, where horizontal and vertical edges of length n are open with probability pn. We show that if lim supn→∞ pn > 0, then there exists an integer N such that PN (0 ↔ ∞) > 0, where PN is the truncated measure obtained by taking pN,n = pn for n ≤ N and pN,n = 0 for all n > N .
متن کاملLong-range percolation in R
Let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spreadout’ percolation model studied by Penrose [6], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the...
متن کاملLong-Range Percolation Mixing Time
We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2 [4, 9], the almost sure mixing time drops from N only to N (up to poly-logarithmic fact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2022
ISSN: ['1879-209X', '0304-4149']
DOI: https://doi.org/10.1016/j.spa.2022.07.005